Unequal weight planar motion vector derivation

ABSTRACT

A system and method of planar motion vector derivation which, in some embodiments can employ an unequal weighted combination of adjacent motion vectors. In some embodiments, motion vector information associated with a bottom right pixel or block adjacent to a current coding unit can be derived from motion information associated with a top row or top neighboring row of a current coding unit and motion information associated with a left column or left neighboring column of a current coding unit. Weighted or non-weighted combinations of such values can be combined in a planar mode prediction model to derive associated motion information for bottom and/or right adjacent pixels or blocks.

CLAIM OF PRIORITY

This Application is a continuation of U.S. patent application Ser. No. 17/725,187 filed Apr. 20, 2022, which is a continuation of U.S. patent application Ser. No. 17/097,312 filed Nov. 13, 2020, now U.S. Pat. No. 11,343,491, which is a continuation of U.S. patent application Ser. No. 16/384,763 filed Apr. 15, 2019, now U.S. Pat. No. 10,841,575, which claims priority under 35 U.S.C. § 119(e) from earlier filed U.S. Provisional Application Ser. No. 62/657,831, filed Apr. 15, 2018, the contents of each of which are incorporated herein by reference in their entirety.

TECHNICAL FIELD

The present disclosure relates to the field of video coding, particularly coding efficiency increases and memory burden associated with reduction of the number of stored collocated pictures.

BACKGROUND

The technical improvements in evolving video coding standards illustrate the trend of increasing coding efficiency to enable higher bit-rates, higher resolutions, and better video quality. The Joint Video Exploration Team developed a new video coding scheme referred to as JVET and is developing a newer video coding scheme referred to a Versatile Video Coding (VVC)—the

complete contents of the VVC t¹¹ edition of draft 2 of the standard tided Versatile Video Coding (Draft 2) by JVET published Oct. 1, 2018 is hereby incorporated herein by reference. Similar to other video coding schemes like HEVC (High Efficiency Video Coding), both JVET and VVC are block-based hybrid spatial and temporal predictive coding schemes. However, relative to HEVC, JVET and VVC include many modifications to bitstream structure, syntax, constraints, and mapping for the generation of decoded pictures. JVET has been implemented in Joint Exploration Model (JEM) encoders and decoders, but VVC is not anticipated to be implemented until early 2020.

Current and anticipated video coding schemes typically utilize simple assumptions adjacent pixel/block similarity to determine values of predicted intensity values for neighboring pixels or pixel blocks. The same process can be implemented for associated Motion Vectors (MV). However, such an assumption can lead to erroneous result. What is needed is a system and method of unequal weight planar motion vector derivation.

SUMMARY

A system of one or more computers can be configured to perform particular operations or actions by value of having software, firmware, hardware, or a combination of them installed on the system that in operation causes or cause the system to perform the actions. One or more computer programs can be configured to perform particular operations or actions by value of including instructions that, when executed by data processing apparatus, cause the apparatus to perform the actions. One general aspect comprises: identifying a coding unit having a top neighboring row, a left neighboring column, a bottom neighboring row and a right neighboring column; determining motion information associated with a bottom right neighboring pixel positioned at the intersection of said bottom neighboring row and said right neighboring column based at least in part on motion information associated with said top row and said left neighboring column; determining motion information associated with said right neighboring column, based at least in part upon said motion information associated with said bottom right neighboring pixel; and encoding said coding unit. Other embodiments of this aspect can comprise corresponding computer systems, apparatus, and computer programs recorded on one or more computer storage devices, each configured to perform the actions of the methods.

Implementations can comprise one or more of the following features: determining motion information associated with said bottom neighboring row, based at least in part upon said motion information associated with said bottom right neighboring pixel; where a planar coding mode is employed; determining a first weight value associated with said top neighboring row, and determining a second weight value associated with said left neighboring column, where said step of determining motion information associated with said bottom right neighboring pixel is based at least in part on a combination of said first weight value and said motion information associated with said top neighboring row with a combination of said second weight value with said motion information associated with said left neighboring column. Implementations of the described techniques can further comprise hardware, a method or process, or computer software on a computer-accessible medium.

Additionally, general aspects can comprise a system of video coding including: storing in memory a coding unit having a top neighboring row, a left neighboring column, a bottom neighboring row and a right neighboring column; determining and storing in said memory motion information associated with a bottom right neighboring pixel positioned at the intersection of said bottom neighboring row and said right neighboring column based at least in part on motion information associated with said top row and said left neighboring column; determining and storing in memory motion information associated with said right neighboring column, based at least in part upon said motion information associated with said bottom right neighboring pixel; and encoding said coding unit. Other embodiments of this aspect include corresponding computer systems, apparatus, and computer programs recorded on one or more computer storage devices, each configured to perform the actions of the methods.

Implementations can comprise one or more of the following features: The system of video coding further including: determining and storing in memory motion information associated with said bottom neighboring row, based at least in part upon said motion information associated with said bottom right neighboring pixel. The system of video coding further including: determining and storing in memory a first weight value associated with said top neighboring row, and determining and storing in memory a second weight value associated with said left neighboring column, where said step of determining motion information associated with said bottom right neighboring pixel is based at least in part on a combination of said first weight value and said motion information associated with said top neighboring row with a combination of said second weight value with said motion information associated with said left neighboring column. Implementations of the described techniques may include hardware, a method or process, or computer software on a computer-accessible medium.

BRIEF DESCRIPTION OF THE DRAWINGS

Further details of the present invention are explained with the help of the attached drawings in which:

FIG. 1 depicts division of a frame into a plurality of Coding Tree Units (CTUs).

FIG. 2 a-2 c depict exemplary partitioning of a CTU into Coding Units (CUs).

FIG. 3 depicts a quadtree plus binary tree (QTBT) representation of FIG. 2 's CU partitioning.

FIG. 4 depicts a simplified block diagram for CU coding in a NET or VVC encoder.

FIG. 5 depicts possible intra prediction modes for luma components in NET of VVC.

FIG. 6 depicts a simplified block diagram for CU coding in a JVET of VVC decoder.

FIGS. 7 a-7 b depict graphical representations of horizontal and vertical prediction calculators, respectively.

FIG. 8 depicts an exemplary embodiment of a weight parameter, S[n], in which sum of the width and height is 256

FIG. 9 depicts an exemplary embodiment of a weight parameter, S[n]. in which sum of the width and height is 512.

FIG. 10 depicts a block flow diagram of a system and method of unequal weight planar motion vector derivation.

FIG. 11 depicts an embodiment of a computer system adapted and configured to provide for variable template size for template matching.

FIG. 12 depicts an embodiment of video encoder/decoder adapted and configured to provide for variable template size for template matching.

DETAILED DESCRIPTION

FIG. 1 depicts division of a frame into a plurality of Coding Tree Units (CTUs) I 00. A frame can be an image in a video sequence. A frame can include a matrix, or set of matrices, with pixel values representing intensity measures in the image. Thus, a set of these matrices can generate a video sequence. Pixel values can be defined to represent color and brightness in full color video coding, where pixels are divided into three channels. For example, in a YCbCr color space pixels can have a luma value, Y, that represents gray level intensity in the image, and two chrominance values, Cb and Cr, that represent the extent to which color differs from gray to blue and red. In other embodiments, pixel values can be represented with values in different color spaces or models. The resolution of the video can determine the number of pixels in a frame. A higher resolution can mean more pixels and a better definition of the image, but can also lead to higher bandwidth, storage, and transmission requirements.

Frames of a video sequence can be encoded and decoded using JVET. JVET is a video coding scheme being developed by the Joint Video Exploration Team. Versions of JVET have been implemented in JEM (Joint Exploration Model) encoders and decoders. Similar to other video coding schemes like HEVC (High Efficiency Video Coding), JVET is a block-based hybrid spatial and temporal predictive coding scheme. During coding with JVET, a frame is first divided into square blocks called CTUs I 00, as shown in FIG. 1 . For example, CTUs I 00 can be blocks of 128×128 pixels.

FIG. 2 a depicts an exemplary partitioning of a CTU I 00 into CUs I 02. Each CTU 100 in a frame can be partitioned into one or more CUs (Coding Units) 102. CUs 102 can be used for prediction and transform as described below. Unlike HEVC, in NET the CUs 102 can be rectangular or square and can be coded without further partitioning into prediction units or transform units. The CUs I 02 can be as large as their root CTUs I 00, or be smaller subdivisions of a root CTU 100 as small as 4×4 blocks.

In JVET, a CTU I 00 can be partitioned into CUs I 02 according to a quadtree plus binary tree (QTBT) scheme in which the CTU 100 can be recursively split into square blocks according to a quadtree, and those square blocks can then be recursively split horizontally or vertically according to binary trees. Parameters can be set to control splitting according to the QTBT, such as the CTU size, the minimum sizes for the quadtree and binary tree leaf nodes, the maximum size for the binary tree root node, and the maximum depth for the binary trees. In VVC, a CTU 100 can be portioned into CUs utilizing ternary splitting also.

By way of a non-limiting example, FIG. 2 a shows a CTU 100 partitioned into CUs I 02, with solid lines indicating quadtree splitting and dashed lines indicating binary tree splitting. As illustrated, the binary splitting allows horizontal splitting and vertical splitting to define the structure of the CTU and its subdivision into CUs. FIGS. 2 b & 2 c depict alternate, non-limiting examples of ternary splitting of a CU wherein subdivisions of the CUs are non-equal.

FIG. 3 depicts a QTBT representation of FIG. 2 's partitioning. A quadtree root node represents the CTU I 00, with each child node in the quadtree portion representing one of four square blocks split from a parent square block. The square blocks represented by the quadtree leaf nodes can then be divided zero or more times using binary trees, with the quadtree leaf nodes being root nodes of the binary trees. At each level of the binary tree portion, a block can be divided either vertically or horizontally. A flag set to “0” indicates that the block is split horizontally, while a flag set to “I” indicates that the block is split vertically.

After quadtree splitting and binary tree splitting, the blocks represented by the QTBTs leaf nodes represent the final CUs 102 to be coded, such as coding using inter prediction or intra prediction. For slices or full frames coded with inter prediction, different partitioning structures can be used for luma and chroma components. For example, for an inter slice a CU I 02 can have Coding Blocks (CBs) for different color components, such as such as one luma CB and two chroma CBs. For slices or full frames coded with intra prediction, the partitioning structure can be the same for luma and chroma components.

FIG. 4 depicts a simplified block diagram for CU coding in a JVET encoder. The main stages of video coding include partitioning to identify CUs I 02 as described above, followed by encoding CUs 102 using prediction at 404 or 406, generation of a residual CU 410 at 408, transformation at 412, quantization at 416, and entropy coding at 420. The encoder and encoding process illustrated in FIG. 4 also includes a decoding process that is described in more detail below.

Given a current CU 102, the encoder can obtain a prediction CU 402 either spatially using intra prediction at 404 or temporally using inter prediction at 406. The basic idea of prediction coding is to transmit a differential, or residual, signal between the original signal and a prediction for the original signal. At the receiver side, the original signal can be reconstructed by adding the residual and the prediction, as will be described below. Because the differential signal has a lower correlation than the original signal, fewer bits are needed for its transmission.

A slice, such as an entire picture or a portion of a picture, coded entirely with intra-predicted CUs can be an I slice that can be decoded without reference to other slices, and as such can be a possible point where decoding can begin. A slice coded with at least some inter-predicted CUs can be a predictive (P) or bi-predictive (B) slice that can be decoded based on one or more reference pictures. P slices may use intra-prediction and inter-prediction with previously coded slices. For example, P slices may be compressed further than the I-slices by the use of inter-prediction, but need the coding of a previously coded slice to code them. B slices can use data from previous and/or subsequent slices for its coding, using intra-prediction or inter-prediction using an interpolated prediction from two different frames, thus increasing the accuracy of the motion estimation process. In some cases P slices and B slices can also or alternately be encoded using intra block copy, in which data from other pmiions of the same slice is used.

As will be discussed below, intra prediction or inter prediction can be performed based on reconstructed CUs 434 from previously coded CUs 102, such as neighboring CUs 102 or CUs 102 in reference pictures.

When a CU 102 is coded spatially with intra prediction at 404, an intra prediction mode can be found that best predicts pixel values of the CU 102 based on samples from neighboring CUs 102 in the picture.

When coding a CU's luma component, the encoder can generate a list of candidate intra prediction modes. While HEVC had 35 possible intra prediction modes for luma components, in JVET there are 67 possible intra prediction modes for luma components and in VVC there are 85 prediction modes. These include a planar mode that uses a three dimensional plane of values generated from neighboring pixels, a DC mode that uses values averaged from neighboring pixels, the 65 directional modes shown in FIG. 5 that use values copied from neighboring pixels along the solid-line indicated directions and 18 wide-angle prediction modes that can be used with non-square blocks.

When generating a list of candidate intra prediction modes for a CU's luma component, the number of candidate modes on the list can depend on the CU's size. The candidate list can include: a subset of HEVC's 35 modes with the lowest SATD (Sum of Absolute Transform Difference) costs; new directional modes added for JVET that neighbor the candidates found from the HEVC modes; and modes from a set of six most probable modes (MPMs) for the CU 102 that are identified based on intra prediction modes used for previously coded neighboring blocks as well as a list of default modes.

When coding a CU's chroma components, a list of candidate intra prediction modes can also be generated. The list of candidate modes can include modes generated with cross-component linear model projection from luma samples, intra prediction modes found for luma CBs in particular collocated positions in the chroma block, and chroma prediction modes previously found for neighboring blocks. The encoder can find the candidate modes on the lists with the lowest rate distortion costs, and use those intra prediction modes when coding the CU's luma and chroma components. Syntax can be coded in the bitstream that indicates the intra prediction modes used to code each CU 102.

After the best intra prediction modes for a CU 102 have been selected, the encoder can generate a prediction CU 402 using those modes. When the selected modes are directional modes, a 4-tap filter can be used to improve the directional accuracy. Columns or rows at the top or left side of the prediction block can be adjusted with boundary prediction filters, such as 2-tap or 3-tap filters.

The prediction CU 402 can be smoothed further with a position dependent intra prediction combination (PDPC) process that adjusts a prediction CU 402 generated based on filtered samples of neighboring blocks using unfiltered samples of neighboring blocks, or adaptive reference sample smoothing using 3-tap or 5-tap low pass filters to process reference samples.

When a CU 102 is coded temporally with inter prediction at 406, a set of motion vectors (MVs) can be found that points to samples in reference pictures that best predict pixel values of the CU I 02. Inter prediction exploits temporal redundancy between slices by representing a displacement of a block of pixels in a slice. The displacement is determined according to the value of pixels in previous or following slices through a process called motion compensation. Motion vectors and associated reference indices that indicate pixel displacement relative to a particular reference picture can be provided in the bitstream to a decoder, along with the residual between the original pixels and the motion compensated pixels. The decoder can use the residual and signaled motion vectors and reference indices to reconstruct a block of pixels in a reconstructed slice.

In JVET, motion vector accuracy can be stored at 1/16 pel, and the difference between a motion vector and a CU's predicted motion vector can be coded with either quarter-pel resolution or integer-pel resolution.

In NET motion vectors can be found for multiple sub-CUs within a CU I 02, using techniques such as advanced temporal motion vector prediction (ATMVP), spatial-temporal motion vector prediction (STMVP), affine motion compensation prediction, pattern matched motion vector derivation (PMMVD), and/or bi-directional optical flow (BIO).

Using ATMVP, the encoder can find a temporal vector for the CU 102 that points to a corresponding block in a reference picture. The temporal vector can be found based on motion vectors and reference pictures found for previously coded neighboring CUs 102. Using the reference block pointed to by a temporal vector for the entire CU 1 02, a motion vector can be found for each sub-CU within the CU 1 02.

STMVP can find motion vectors for sub-CUs by scaling and averaging motion vectors found for neighboring blocks previously coded with inter prediction, together with a temporal vector.

Affine motion compensation prediction can be used to predict a field of motion vectors for each sub-CU in a block, based on two control motion vectors found for the top corners of the block. For example, motion vectors for sub-CUs can be derived based on top corner motion vectors found for each 4×4 block within the CU 102.

PMMVD can find an initial motion vector for the current CU 102 using bilateral matching or template matching. Bilateral matching can look at the current CU 102 and reference blocks in two different reference pictures along a motion trajectory, while template matching can look at corresponding blocks in the current CU 102 and a reference picture identified by a template. The initial motion vector found for the CU 102 can then be refined individually for each sub-CU.

BIO can be used when inter prediction is performed with bi-prediction based on earlier and later reference pictures, and allows motion vectors to be found for sub-CUs based on the gradient of the difference between the two reference pictures.

In some situations local illumination compensation (LIC) can be used at the CU level to find values for a scaling factor parameter and an offset parameter, based on samples neighboring the current CU 102 and corresponding samples neighboring a reference block identified by a candidate motion vector. In JVET, the LIC parameters can change and be signaled at the CU level.

For some of the above methods the motion vectors found for each of a CU's sub-CUs can be signaled to decoders at the CU level. For other methods, such as PMMVD and BIO, motion information is not signaled in the bitstream to save overhead, and decoders can derive the motion vectors through the same processes.

After the motion vectors for a CU 102 have been found, the encoder can generate a prediction CU 402 using those motion vectors. In some cases, when motion vectors have been found for individual sub-CUs, Overlapped Block Motion Compensation (OBMC) can be used when generating a prediction CU 402 by combining those motion vectors with motion vectors previously found for one or more neighboring sub-CUs.

When bi-prediction is used, NET can use decoder-side motion vector refinement (DMVR) to find motion vectors. DMVR allows a motion vector to be found based on two motion vectors found for bi-prediction using a bilateral template matching process. In DMVR, a weighted combination of prediction CUs 402 generated with each of the two motion vectors can be found, and the two motion vectors can be refined by replacing them with new motion vectors that best point to the combined prediction CU 402. The two refined motion vectors can be used to generate the final prediction CU 402.

At 408, once a prediction CU 402 has been found with intra prediction at 404 or inter prediction at 406 as described above, the encoder can subtract the prediction CU 402 from the current CU I 02 find a residual CU410.

The encoder can use one or more transform operations at 412 to convert the residual CU 410 into transform coefficients 414 that express the residual CU 410 in a transform domain, such as using a discrete cosine block transform (DCT-transform) to convert data into the transform domain. JVET allows more types of transform operations than HEVC, including DCT-II, DST-VII, DST-VII, DCT-VIII, DST-I, and DCT-V operations. The allowed transform operations can be grouped into sub-sets, and an indication of which sub-sets and which specific operations in those sub-sets were used can be signaled by the encoder. In some cases, large block-size transforms can be used to zero out high frequency transform coefficients in CUs 102 larger than a certain size, such that only lower-frequency transform coefficients are maintained for those CUs 102.

In some cases a mode dependent non-separable secondary transform (MDNSST) can be applied to low frequency transform coefficients 414 after a forward core transform. The MDNSST operation can use a Hypercube-Givens Transform (HyGT) based on rotation data. When used, an index value identifying a particular MDNSST operation can be signaled by the encoder.

At 416, the encoder can quantize the transform coefficients 414 into quantized transform coefficients 416. The quantization of each coefficient may be computed by dividing a value of the coefficient by a quantization step, which is derived from a quantization parameter (QP). In some embodiments, the Qstep is defined as 2QP-

. Because high precision transform coefficients 414 can be converted into quantized transform coefficients 416 with a finite number of possible values, quantization can assist with data compression. Thus, quantization of the transform coefficients may limit an amount of bits generated and sent by the transformation process. However, while quantization is a lossy operation, and the loss by quantization cannot be recovered, the quantization process presents a trade-off between quality of the reconstructed sequence and an amount of information needed to represent the sequence. For example, a lower QP value can result in better quality decoded video, although a higher amount of data may be required for representation and transmission. In contrast, a high QP value can result in lower quality reconstructed video sequences but with lower data and bandwidth needs.

NET can utilize variance-based adaptive quantization techniques, which allows every CU 102 to use a different quantization parameter for its coding process (instead of using the same frame QP in the coding of every CU 1 02 of the frame). The variance-based adaptive quantization techniques adaptively lowers the quantization parameter of certain blocks while increasing it in others. To select a specific QP for a CU 1 02, the CU's variance is computed. In brief, if a CU's variance is higher than the average variance of the frame, a higher QP than the frame's QP may be set for the CU 102. If the CU 102 presents a lower variance than the average variance of the frame, a lower QP may be assigned.

At 420, the encoder can find final compression bits 422 by entropy coding the quantized transform coefficients 418. Entropy coding aims to remove statistical redundancies of the information to be transmitted. In VET, CABAC (Context Adaptive Binary Arithmetic Coding) can be used to code the quantized transform coefficients 418, which uses probability measures to remove the statistical redundancies. For CUs 102 with non-zero quantized transform coefficients 418, the quantized transform coefficients 418 can be converted into binary. Each bit (“bin”) of the binary representation can then be encoded using a context model. A CU 102 can be broken up into three regions, each with its own set of context models to use for pixels within that region.

Multiple scan passes can be performed to encode the bins. During passes to encode the first three bins (bin0, bin1, and bin2), an index value that indicates which context model to use for the bin can be found by finding the sum of that bin position in up to five previously coded neighboring quantized transform coefficients 418 identified by a template.

A context model can be based on probabilities of a bin's value being ‘O’ or ‘1’. As values are coded, the probabilities in the context model can be updated based on the actual number of ‘O’ and ‘I’ values encountered. While HEVC used fixed tables to re-initialize context models for each new picture, in JVET the probabilities of context models for new inter-predicted pictures can be initialized based on context models developed for previously coded inter-predicted pictures.

The encoder can produce a bitstream that contains entropy encoded bits 422 of residual CUs 410, prediction information such as selected intra prediction modes or motion vectors, indicators of how the CUs 102 were partitioned from a CTU 100 according to the QTBT structure, and/or other information about the encoded video. The bitstream can be decoded by a decoder as discussed below.

In addition to using the quantized transform coefficients 418 to find the final compression bits 422, the encoder can also use the quantized transform coefficients 418 to generate reconstructed CUs 434 by following the same decoding process that a decoder would use to generate reconstructed CUs 434. Thus, once the transformation coefficients have been computed and quantized by the encoder, the quantized transform coefficients 418 may be transmitted to the decoding loop in the encoder. After quantization of a CU's transform coefficients, a decoding loop allows the encoder to generate a reconstructed CU 434 identical to the one the decoder generates in the decoding process. Accordingly, the encoder can use the same reconstructed CUs 434 that a decoder would use for neighboring CUs 102 or reference pictures when performing intra prediction or inter prediction for a new CU 102. Reconstructed CUs 102, reconstructed slices, or full reconstructed frames may serve as references for further prediction stages.

At the encoder's decoding loop (and see below, for the same operations in the decoder) to obtain pixel values for the reconstructed image, a dequantization process may be performed. To dequantize a frame, for example, a quantized value for each pixel of a frame is multiplied by the quantization step, e.g., (Qstep) described above, to obtain reconstructed dequantized transform coefficients 426. For example, in the decoding process shown in FIG. 4 in the encoder, the quantized transform coefficients 418 of a residual CU 410 can be dequantized at 424 to find dequantized transform coefficients 426. If an MDNSST operation was performed during encoding, that operation can be reversed after dequantization.

At 428, the dequantized transform coefficients 426 can be inverse transformed to find a reconstructed residual CU 430, such as by applying a DCT to the values to obtain the reconstructed image. At 432 the reconstructed residual CU 430 can be added to a corresponding prediction CU 402 found with intra prediction at 404 or inter prediction at 406, in order to find a reconstructed CU 434.

At 436, one or more filters can be applied to the reconstructed data during the decoding process (in the encoder or, as described below, in the decoder), at either a picture level or CU level. For example, the encoder can apply a deblocking filter, a sample adaptive offset (SAO) filter, and/or an adaptive loop filter (ALF). The encoder's decoding process may implement filters to estimate and transmit to a decoder the optimal filter parameters that can address potential artifacts in the reconstructed image. Such improvements increase the objective and subjective quality of the reconstructed video. In deblocking filtering, pixels near a sub-CU boundary may be modified, whereas in SAO, pixels in a CTU 1 00 may be modified using either an edge offset or band offset classification. JVET's ALF can use filters with circularly symmetric shapes for each 2×2 block. An indication of the size and identity of the filter used for each 2×2 block can be signaled.

If reconstructed pictures are reference pictures, they can be stored in a reference buffer 438 for inter prediction of future CUs 102 at 406.

During the above steps, NET allows a content adaptive clipping operations to be used to adjust color values to fit between lower and upper clipping bounds. The clipping bounds can change for each slice, and parameters identifying the bounds can be signaled in the bitstream.

FIG. 6 depicts a simplified block diagram for CU coding in a NET decoder. A NET decoder can receive a bitstream containing information about encoded CUs 102. The bitstream can indicate how CUs 1 02 of a picture were partitioned from a CTU 100 according to a QTBT structure, prediction information for the CUs 102 such as intra prediction modes or motion vectors, and bits 602 representing entropy encoded residual CUs.

At 604 the decoder can decode the entropy encoded bits 602 using the CABAC context models signaled in the bitstream by the encoder. The decoder can use parameters signaled by the encoder to update the context models' probabilities in the same way they were updated during encoding.

After reversing the entropy encoding at 604 to find quantized transform coefficients 606, the decoder can dequantize them at 608 to find dequantized transform coefficients 610. If an MDNSST operation was performed during encoding, that operation can be reversed by the decoder after dequantization.

At 612, the dequantized transform coefficients 610 can be inverse transformed to find a reconstructed residual CU 614. At 616, the reconstructed residual CU 614 can be added to a corresponding prediction CU 626 found with intra prediction at 622 or inter prediction at 624, in order to find a reconstructed CU 618.

At 620, one or more filters can be applied to the reconstructed data, at either a picture level or CU level. For example, the decoder can apply a deblocking filter, a sample adaptive offset (SAO) filter, and/or an adaptive loop filter (ALF). As described above, the in-loop filters located in the decoding loop of the encoder may be used to estimate optimal filter parameters to increase the objective and subjective quality of a frame. These parameters are transmitted to the decoder to filter the reconstructed frame at 620 to match the filtered reconstructed frame in the encoder.

After reconstructed pictures have been generated by finding reconstructed CUs 618 and applying signaled filters, the decoder can output the reconstructed pictures as output video 628. If reconstructed pictures are to be used as reference pictures, they can be stored in a reference buffer 630 for inter prediction of future CUs 102 at 624.

Planar mode is often the most frequently used intra coding mode in VVC, HEVC and JVET. FIG. 7 a and 76 show VVC, HEVC and JVET Planar predictor generation process for horizontal prediction calculation (FIG. 7 a ) 700 and vertical predictor calculation (FIG. 76 ) 710 for a coding unit (block) with height H=8 702 and width W=8 704, where the (0,0) 706 coordinator corresponds to the top-left position within the coding CU.

Planar mode in VVC, HEVC and JVET (HEVC Planar) generates a first order approximation of the prediction for a current Coding Unit (CU), by forming a plane based on the intensity values of the neighboring pixels. Due to the raster-scan coding order, the reconstructed left column neighboring pixels and the reconstructed top row neighboring pixels are available for a current CU, but not the right column neighboring pixels and the bottom row neighboring pixels. The planar predictor generation process of VVC, HEVC and NET sets the intensity values of all the right column neighboring pixels to be the same as the intensity value of the top right neighboring pixel, and the intensity values of all the bottom row pixels to be the same as the intensity value of the bottom left neighboring pixel.

Once the neighboring pixels surrounding predicting block are defined, the horizontal and the vertical predictors (Ph(x,y) and Py(x,y), respectively) for each pixel within the CU can be determined according to following equations:

Ph(x,y)=(W−1−x)*R(−1,y)+(x+1)*R(W,−1)

Py(x,y)=(H−1−y)*R(x,−1)+(y+1)*R(−1,H)

wherein

R(x, y) denotes the intensity value of the reconstructed neighboring pixel at. (x, y) coordinate;

W is block width; and

H is block height.

From these values, the final planar predictor, P(x, y), is computed by averaging the horizontal and vertical predictors, with certain adjustment when the current CU is non-square according to the following equation:

${{P\left( {x,y} \right)} = \frac{{H \star {P_{h}\left( {x,y} \right)}} + {W \star {P_{v}\left( {x,y} \right)}}}{2 \star H \star W}}❘$

This planar prediction concept can be applied to determine MVs at fine granularity. In VVC and JVET, each 4×4 sub-block within a CU can have its own MV. If MV(x,y) is assumed to be a MV of a sub-block containing pixel (x,y) and the planar intra prediction concept described earlier then, a reconstructed pixel, R(−..:,y), can be converted to a MV at the sub-block level, MV(−..:,y), noting specifically that for intra planar, R(x,y) is a 1-D intensity, while for inter planar, P(x,y) is a 2-D MV. That is, the horizontal and the vertical predictors P11,(x,y) and Py(x,y), respectively can be converted to the horizontal and the vertical MV predictors (MVh(x, y) and MVv(x, y), respectively. Then the final Planar MV, (MV(x, y), can be computed by averaging the horizontal and vertical predictors.

In some embodiments, multiple reference slices can be available for temporal prediction. Hence, neighboring sub-blocks can use difference references for their associated MVs. For simplicity, one reference can be used when combining more than one MV where more than one reference is employed. In some embodiment, one possible option to combine multiple references is to select the reference of the neighbor sub-block closest, in terms of POC distance, to the coding picture.

Planar derivation of.MY can require the MV of the CU surrounding neighbor sub-blocks. However, in some embodiments, it may be possible that some neighboring sub-blocks can be considered unavailable for planar derivation, because they may not have a suitable MV. By way of non-limiting example, the neighboring sub-block can be coded with intra mode, may not use appropriate reference list, or may not use an appropriate reference slice. In such cases, a default MV or a substitute MV can be used in place of the specific MV of the neighboring sub-block. In such a situation, a substitute MV can be used, for example, based on the MV of the first available adjacent neighbors. In alternate embodiments in which a neighboring sub-block MV doesn't use appropriate reference slice in presented, one possible option is to scale the available MV to the desired reference slice with weighting factor(s) according to a ratio of temporal distances.

The present disclosure presents a system and method to derive the MV of the bottom right neighboring sub-block for a current CU (lifting process), and then compute the MV of the bottom row and the right column neighboring sub-blocks, using the derived MV of the bottom right neighboring sub-block along with the MV of other corner neighboring sub-blocks, such as the top right neighboring sub-block, the bottom left neighboring sub-block.

In some embodiments, the bottom right sub-block MV derivation process can be a weighted average of the top right and the bottom left neighboring sub-blocks, as defined in on the equations presented below:

${{MV}\left( {W,H} \right)} = \frac{{W \star {{MV}\left( {W,{- 1}} \right)}} + {H \star {{MV}\left( {{- 1},H} \right)}}}{H + W}$ ${{MV}\left( {W,H} \right)} = \frac{{H \star {{MV}\left( {W,{- 1}} \right)}} + {W \star {{MV}\left( {{- 1},H} \right)}}}{H + W}$

In alternate embodiments, a flat plane can be assumed and based on the MV of the top left, the top right, and the bottom left neighboring sub-blocks, the MV can be derived based on the following equation:

MV(W,H)=MV(W,−1)+MV(−1,H)MV(−1,−1)

where position (0, 0) denotes the top-left sub-block position of the current block, .!:!:: is the width of the current block and H is the height of the current block. A1V(x, y) can therefore denote the MV of the reconstructed sub-block containing pixel at position (x, y) as well as the estimated/predicted MV at sub-block containing position (x, y).

Yet another non-limiting example can be based on deriving the bottom right sub-block MV using the MV of the sub-block at co-located position containing pixel (W, H) in the co-located reference (similar to TMVP derivation).

Having derived the MV of the bottom right neighboring sub-block of.MV(W, H), the MV of the bottom row neighboring sub-blocks, MVb(x, H), and the right column neighboring sub-blocks, Ml7r(W, y), can be computed. If linear interpolation is assumed then the MVs can be defined as follows:

${{MV}_{b}\left( {x,H} \right)} = \frac{{\left( {W - 1 - x} \right) \star {{MV}\left( {{- 1},H} \right)}} + {\left( {x + 1} \right) \star {{MV}\left( {W,H} \right)}}}{W}$ ${{MV}_{r}\left( {W,y} \right)} = \frac{{\left( {H - 1 - Y} \right) \star {{MV}\left( {W,{- l}} \right)}} + {\left( {y + l} \right) \star {{MV}\left( {W,H} \right)}}}{H}$

However, in alternate embodiments, models other than linear interpolation can be used to the relevant MVs.

Once the motion vectors of neighboring sub-blocks surrounding a current CU are defined, the horizontal and the vertical MV (MVh(x, y) and MVy(x, y), respectively) for each sub-block within the CU can be determined according to the following equations:

MV,i(x,y)(W−1−x)*MV(−1,y)+(x+1)*MVr(W,y)

MVv(x,y)=(H−1−y)*MV(x,−1)=(y+1)*MVb(x,H)

Wherein MV1i(x, y) and j11Vv(x, y) are scaled up versions of horizontal and vertical MV predictors. However, these factors can be compensated for in the final MV predictor calculation step.

In some embodiments, top-right and bottom-left corner sub-block positions can be set to be MV(W−1, −1) and MV(−1, H−1), respectively. In such embodiments, interpolation for intermediate predictors can be described as an example by of the following equations:

${{MV}\left( {{W - 1},{H - 1}} \right)} = \frac{{W \star {{MV}\left( {{W - l},{- l}} \right)}} + {H \star {{MV}\left( {{- 1},{H - 1}} \right)}}}{H + W}$ ${{MV}_{b}\left( {x,{H - 1}} \right)} = \frac{{\left( {W - 1 - x} \right) \star {{MV}\left( {{- 1},{H - 1}} \right)}} + {\left( {x + 1} \right) \star {{MV}\left( {{W - 1},{H - 1}} \right)}}}{W}$ ${{MV}_{r}\left( {{W - 1},y} \right)} = \frac{{\left( {H - l - Y} \right) \star {{MV}\left( {{W - 1},{- l}} \right)}} + {\left( {v + l} \right) \star {{MV}\left( {{W - 1},{H - 1}} \right)}}}{H}$ MV1i(x, y) = (W − 1 − x) ⋆ MV(−1, y) + (x + 1) ⋆ M ∖  ^(′)r(W − 1, y) Ml7v(x, y) = (H − 1 − y) ⋆ MV(x, −1) + (y + 1) ⋆ MVb(x, H − 1)

Some embodiments can utilize an unequal-weight combination for the final Planar MV derivation. Unequal weight can be employed to take advantage of differences in accuracy of input intensity in the final interpolation process. Specifically, larger weights can be applied to sub-block positions that are closer to more reliable neighboring sub-block positions. In VVC and NET, the processing order follows raster scan at the CTU level and z-scan for CUs within a CTU. Hence, the top row and the left column neighboring sub-blocks are the actual reconstructed sub-blocks and are more reliable than the bottom row and right column neighboring sub-blocks, which are estimated. An example application using unequal weight employed at the final MV derivation is described in the following equation:

${{MV}\left( {x,y} \right)} = \frac{{H \star {{MV}_{h}\left( {x,y} \right)} \star \left( {y + 1} \right)} + {W \star {{MV}_{v}\left( {x,y} \right)} \star \left( {x + 1} \right)}}{H \star W \star \left( {x + y + 2} \right)}$

And an example of unequal weight assignment shown in the above equation can be generalized into a generic equation as shown below:

${{MV}(x)} = {{A\underset{\,^{\prime}y}{\left( {x,y} \right) \star {MV}}11\left( {x,y} \right)} + {{B\left( {x,y} \right)} \star {{MVv}\left( {x,y} \right)}} + \underset{D({x,y})}{c\left( {x,y} \right)}}$

where A(x,y) and B(x,y) are the position dependent weighting factors for horizontal and vertical predictors, respectively, is a position dependent rounding factor, and D(x}′,} is a position dependent scaling factor.

It should be noted that unequal weight assignment can also be used at the horizontal and vertical MV predictor computation phase and that the bottom right position adjustment and unequal weight assignment components can be used together or separately depending on codec design considerations. In some embodiments, weighting factors and lifting process can be modified according to picture type (I, P, B, and/or any other known, convenient and/or desired type), temporal layer, color component (Y, Cb, Cr, and/or any other known convenient and/or desired color component).

In some embodiments, a special merge mode with a unique merge candidate index can be used to signal usage of unequal weight planar MV derivation. In embodiments in which this special merge mode is selected the merge sub-block MV can be computed according to the following the following equations:

${{MV}\left( {x,y} \right)} = \frac{{H \star {{MV}_{h}\left( {x,y} \right)} \star \left( {y + 1} \right)} + {W \star {{MV}_{v}\left( {x,y} \right)} \star \left( {x + 1} \right)}}{H \star W \star \left( {x + y + 2} \right)}$ ${{MV}(x)} = {{A\underset{\,^{\prime}Y}{\left( {x,y} \right) \star {MV}}{h\left( {x,y} \right)}} + {{B\left( {x,y} \right)} \star {{MVv}\left( {x,y} \right)}} + \underset{D({x,y})}{c\left( {x,y} \right)}}$

Equations associated with the bottom right sub-block position adjustment process and unequal weight assignment process, respectively, as presented above involve division operations, which can be costly in terms of computational complexity. However, these division operations can be generally be converted into scale operations to make them more efficient and implementation friendly, as presented in the below equations:

MV(W,H)=((W*MV(W,−1)+H*MV(−1,H))*S[W+H])>>ShiftDenom

MV(W,H)=(H*MV(W,−1)+W*MV(−1,H))*s[W+HJ)>>ShiftDenom

MVb(x,H)=(((W−1−x)*MV(−1,H)+(x+1)*MV(W,H))*S[W])>>ShiftDenom

M½−(W,y)=(((H−1−y)*MV(W,−1)+(y+1)*MV(W,H))*S[H])>>ShiftDenom

MV(x,y)=((H*MVh(x,y)*(y+1)+W*MVv(x,y)*(x+1))*S[x+y+ZJ)>>(ShiftDenom+log₂ W+log₂ H)

where S[n] a weight factor of parameter n, and Shi{tDenom is a factor for shifted down operation. Specifically, S[n] is an approximation of the factor

and can be described as:

S[n]=Round C<<Shi:Denom)

An example of S[n] 800, where sum of width and height is 256 and ShiftDenom is 10 is depicted in FIG. 8 and another example of S[n] 900, where sum of width and height is 512 and ShiftDenom is 10 is depicted in FIG. 9 .

In the examples presented in FIGS. 8 and 9 , a memory size of 2570 bits (257 entries with IO bits each for FIG. 8 ) and 5130 bits (513 entries with IO bits each for FIG. 9 ) are required to hold the weight tables. This memory size may be excessive and memory burdensome and thus it can be beneficial to efficiency and for memory management to reduce this memory requirement. Below are presented two examples of two possible ways to accomplish reduced size of S[n] and memory burden.

Presented below is a non-limiting example of S[n], where sum of width and height is 128 and ShiftDenom is 10 is shown below.

-   -   S[n]={341J 256J 205J 171J 146J 128J 114J 102J 93J 85J 79J 73J         68, 64, 60, 57, 54, 51J 49, 47, 45, 43, 41, 39, 38J 37, 35, 34,         33, 32, 31, 30, 29, 28, 28, 27, 26, 26, 25, 24, 24, 23, 23, 22,         22, 21, 21, 20, 20, 20, 19, 19, 19, 18, 18, 18, 17, 17, 17, 17,         16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13,         13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11,         11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9J 9,         9, 9, 9J 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8}

Another non-limiting example of S[n], where sum of width and height is 128 and ShiftDenom is 9 is shown below.

-   -   S[n]={111, 128, 102, 85, 73, 64, 57, 51, 47, 43, 39, 37, 34, 32,         30, 28, 27, 26, 24, 23, 22, 21, 20, 20, 19, 18, 18, 17, 17, 16,         16, 15, 15, 14, 14, 13, 13, 13, 12, 12, 12, 12, 11, 11, 11, 11,         10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8,         7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,         6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,         5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4)}

In the above examples, only 126 entries of 129 necessary are required to be stored, since the first two entries (1/0 and 1/1) are not used in the system and method presented. Additionally, the third entry, representing ½, has value of 512 and 256 in the above examples, and it can be handled separately during weight calculation. Accordingly, weight average calculations shown in the above-presented equations:

MVb(x,H)=(((W−1−x)*MV(−1,H)+(x+1)*MV(W,H))*S[W])>>ShiftDenom

MV,(W,y)=(((H−1−y)*MV(W,−1)+(y+1)*MV(W,H))*S[H])>>ShiftDenom

can be modified as shown in the below equations:

MVb(x,H)=(((W−1−x)*MV(−1,H)+(x+1)*MV(W,H))*S[W−3])>>ShiftDenom

MV,(W,y)=(((H−1−y)*MV(W,−1)+(y+1)*MV(W,H))*S[H−3]).>>ShiftDenom

However,

${S\lbrack n\rbrack} = {{Round}\frac{\left( {1 \ll {ShiftDenom}} \right)}{11}}$

may not provide accurate outputs, thus resulting in poor coding efficiency. The ineffectiveness can be due to the conversion process which can allow errors to accumulate linearly with distance. In some embodiments, this error can be reduced by exploiting the fact that the weight for horizontal and vertical predictors are complimentary in the following equation:

${{MV}\left( {x,y} \right)} = \frac{{H \star {{MV}_{h}\left( {x,y} \right)} \star \left( {y + 1} \right)} + {W \star {{MV}_{v}\left( {x,y} \right)} \star \left( {x + 1} \right)}}{H \star W \star \left( {x + y + 2} \right)}$

Accordingly, weighting can be computed based on that of the horizontal or vertical predictor, whichever is more accurate. This can be accomplished by introducing parameters horWeight and verWeight are introduced into the following equation:

${S\lbrack n\rbrack} = {{Round}\left( \frac{1 \ll {ShiftDenom}}{n} \right)}$

which results in following equations:

MV(x, y) = (H ⋆ MVh(x, y) ⋆ horWeight + W ⋆ MVp(x, y) ⋆ verWeight) ≫ (ShiftDenom + log₂W + log₂H) ${horWeight} = \begin{matrix} \left\{ {\left( {1 \ll {ShiftDenom}} \right) - {verWeight}} \right. & {{{when}x} < y} \\ {\left( {y + 1} \right) \star {S\left\lbrack {x + y + 2} \right\rbrack}} & {otherwise} \end{matrix}$ ${verWeight} = \begin{matrix} \left\{ {\left( {x + 1} \right) \star {S\left\lbrack {x + y + 2} \right\rbrack}} \right. & {{{when}x} < y} \\ {\left( {1 \ll {ShiftDenom}} \right) - {horWeight}} & {otherwise} \end{matrix}$

Alternately, the following equations can be employed when reduced tables as identified above are used.

${horWeight} = \begin{matrix} \left\{ {\left( {1 \ll {ShiftDenom}} \right) - {verWeight}} \right. & {{{when}x} < y} \\ {\left( {y + 1} \right) \star {S\left\lbrack {x + y - 1} \right\rbrack}} & {otherwise} \end{matrix}$ ${verWeight} = \begin{matrix} \left\{ {\left( {x + 1} \right) \star {S\left\lbrack {x + y - 1} \right\rbrack}} \right. & {{{when}x} < y} \\ {\left( {1 \ll {ShiftDenom}} \right) - {horWeight}} & {otherwise} \end{matrix}$ horWeight = verWeight = (1 ≪ (ShiftDenom − 1))whenx = y = O

In some embodiments, the table size to store weight of parameter, S[n], can be further reduced since unequal weight planar MV derivation operates at the sub-block level, since the sub-block level can configured at a coarser granularity, such as 4×4 in VVC and JVET, rather than at the pixel level.

Thus, when a sub-block size is N×N, then MV(x,y) can be mapped into sub-block coordinate MV(x/N,y/N). With a reduced dimension from W×H to (W/N)×(H/N), the maximum size of table is correspondingly lower, thus a smaller table size can be used. Accordingly, the above equations can be reformulated and presented as:

MV(.) = rn ⋆ MVh(,) ⋆ horWeight +  : ⋆M{lv(,) ⋆ verWeight) ≫ (Shi[tDenom + log_(2(:)) + log z(Z)) ${horWeight} = \begin{matrix} \left\{ {\left( {1 \ll {ShiftDenom}} \right) - {verWeight}} \right. & {\underset{N}{when} < \underset{N}{l.}} \\ \text{?} & {otherwise} \end{matrix}$ ${verWeight} = \begin{matrix} \text{?} & {\underset{N}{when} < \underset{N}{l.}} \\ \left\{ {\left( {1 \ll {ShiftDenom}} \right) - {horWeight}} \right. & {otherwise} \end{matrix}$ ?indicates text missing or illegible when filed

FIG. 10 depicts a block flow diagram 1000 of a system and method of unequal weight planar motion vector derivation. In step 1002 a CU is received then in step 1004 motion information associated with the CU is determined. Then in step 1 006 motion information associated with the bottom right neighboring pixel or block is derived based on motion information associated with the CU. Then in steps 1008 and 1010 motion information can be derived and/or defined based at least in part on the motion information associated with the CU and motion information associated with the derived bottom right neighboring pixel or block in accordance with the systems and methods described herein. While FIG. 1 0 depicts step 1 008 preceding step 1010, in some embodiments, steps I 008 and IO IO can proceed in parallel and/or step IO IO can preceded step 1008. In step 1012 it is determined whether unequal weighting techniques were used to derive the relevant motion vectors. If in step IO12 it is determined that weighting was not employed, then the system can proceed to encoding, as described herein, in step IO14. If however in step 1 O12 it is determined that motion information was derived using a weighted combination technique, then an indicator can be set in step IO16 and the system can proceed to encoding in step 1014.

The execution of the sequences of instructions required to practice the embodiments can be performed by a computer system 1100 as shown in FIG. 11 . In an embodiment, execution of the sequences of instructions is performed by a single computer system 1100. According to other embodiments, two or more computer systems 1100 coupled by a communication link 1115 can perform the sequence of instructions in coordination with one another. Although a description of only one computer system 1100 will be presented below, however, it should be understood that any number of computer systems 1100 can be employed to practice the embodiments.

A computer system 1100 according to an embodiment will now be described with reference to FIG. 11 , which is a block diagram of the functional components of a computer system 1100. As used herein, the term computer system 1100 is broadly used to describe any computing device that can store and independently run one or more programs.

Each computer system 1100 can include a communication interface 1114 coupled to the bus 1106. The communication interface 1114 provides two-way communication between computer systems 1100. The communication interface 1114 of a respective computer system 1100 transmits and receives electrical, electromagnetic or optical signals, that include data streams representing various types of signal information, e.g., instructions, messages and data. A communication link 1115 links one computer system 1100 with another computer system 1100. For example, the communication link 1115 can be a LAN, in which case the communication interface 1114 can be a LAN card, or the communication link 1115 can be a PSTN, in which case the communication interface 1114 can be an integrated services digital network (ISDN) card or a modem, or the communication link 1115 can be the Internet, in which case the communication interface 1114 can be a dial-up, cable or wireless modem.

A computer system 1100 can transmit and receive messages, data, and instructions, including program, i.e., application, code, through its respective communication link 1115 and communication interface 1114. Received program code can be executed by the respective processor(s) 1107 as it is received, and/or stored in the storage device 1110, or other associated non-volatile media, for later execution.

In an embodiment, the computer system 1100 operates in conjunction with a data storage system 1131, e.g., a data storage system 1131 that contains a database 1132 that is readily accessible by the computer system 1100. The computer system 1100 communicates with the data storage system 1131 through a data interface 1133. A data interface 1133, which is coupled to the bus 1106, transmits and receives electrical, electromagnetic or optical signals, that include data streams representing various types of signal information, e.g., instructions, messages and data. In embodiments, the functions of the data interface 1133 can be performed by the communication interface 1114.

Computer system 1100 includes a bus 1106 or other communication mechanism for communicating instructions, messages and data, collectively, information, and one or more processors 1107 coupled with the bus 1106 for processing information. Computer system 1100 also includes a main memory 1108, such as a random access memory (RAM) or other dynamic storage device, coupled to the bus 1106 for storing dynamic data and instructions to be executed by the processor(s) 1107. The main memory 1108 also can be used for storing temporary data, i.e., variables, or other intermediate information during execution of instructions by the processor(s) 1107.

The computer system 1100 can further include a read only memory (ROM) 1109 or other static storage device coupled to the bus 1106 for storing static data and instructions for the processor(s) 1107. A storage device 1110, such as a magnetic disk or optical disk, can also be provided and coupled to the bus 1106 for storing data and instructions for the processor(s) 1107.

A computer system 1100 can be coupled via the bus 1106 to a display device 1111, such as, but not limited to, a cathode ray tube (CRT) or a liquid-crystal display (LCD) monitor, for displaying information to a user. An input device 1112, e.g., alphanumeric and other keys, is coupled to the bus 1106 for communicating information and command selections to the processor(s) 1107.

According to one embodiment, an individual computer system 1100 performs specific operations by their respective processor(s) 1107 executing one or more sequences of one or more instructions contained in the main memory 1108. Such instructions can be read into the main memory 1108 from another computer-usable medium, such as the ROM 1109 or the storage device 1110. Execution of the sequences of instructions contained in the main memory 1108 causes the processor(s) 1107 to perform the processes described herein. In alternative embodiments, hard-wired circuitry can be used in place of or in combination with software instructions. Thus, embodiments are not limited to any specific combination of hardware circuitry and/or software.

The term “computer-usable medium,” as used herein, refers to any medium that provides information or is usable by the processor(s) 1107. Such a medium can take many forms, including, but not limited to, non-volatile, volatile and transmission media. Non-volatile media, i.e., media that can retain information in the absence of power, includes the ROM II09, CD ROM, magnetic tape, and magnetic discs. Volatile media, i.e., media that can not retain information in the absence of power, includes the main memory I I 08. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise the bus II06. Transmission media can also take the form of carrier waves; i.e., electromagnetic waves that can be modulated, as in frequency, amplitude or phase, to transmit information signals. Additionally, transmission media can take the form of acoustic or light waves, such as those generated during radio wave and infrared data communications.

In the foregoing specification, the embodiments have been described with reference to specific elements thereof. It will, however, be evident that various modifications and changes can be made thereto without departing from the broader spirit and scope of the embodiments. For example, the reader is to understand that the specific ordering and combination of process actions shown in the process flow diagrams described herein is merely illustrative, and that using different or additional process actions, or a different combination or ordering of process actions can be used to enact the embodiments. The specification and drawings are, accordingly, to be regarded in an illustrative rather than restrictive sense.

It should also be noted that the present invention can be implemented in a variety of computer systems. The various techniques described herein can be implemented in hardware or software, or a combination of both. Preferably, the techniques are implemented in computer programs executing on programmable computers that each include a processor, a storage medium readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device. Program code is applied to data entered using the input device to perform the functions described above and to generate output information. The output information is applied to one or more output devices. Each program is preferably implemented in a high level procedural or object oriented programming language to communicate with a computer system. However, the programs can be implemented in assembly or machine language, if desired. In any case, the language can be a compiled or interpreted language. Each such computer program is preferably stored on a storage medium or device (e.g., ROM or magnetic disk) that is readable by a general or special purpose programmable computer for configuring and operating the computer when the storage medium or device is read by the computer to perform the procedures described above. The system can also be considered to be implemented as a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner. Further, the storage elements of the exemplary computing applications can be relational or sequential (flat file) type computing databases that are capable of storing data in various combinations and configurations.

FIG. 12 is a high level view of a source device 1212 and destination device 1210 that may incorporate features of the systems and devices described herein. As shown in FIG. 12 , example video coding system 1210 includes a source device 1212 and a destination device 1214 where, in this example, the source device 1212 generates encoded video data. Accordingly, source device 1212 may be referred to as a video encoding device. Destination device 1214 may decode the encoded video data generated by source device 1212. Accordingly, destination device 1214 may be referred to as a video decoding device. Source device 1212 and destination device 1214 may be examples of video coding devices.

Destination device 1214 may receive encoded video data from source device 1212 via a channel 1216. Channel 1216 may comprise a type of medium or device capable of moving the encoded video data from source device 1212 to destination device 1214. In one example, channel 1216 may comprise a communication medium that enables source device 1212 to transmit encoded video data directly to destination device 1214 in real-time.

In this example, source device 1212 may modulate the encoded video data according to a communication standard, such as a wireless communication protocol, and may transmit the modulated video data to destination device 1214. The communication medium may comprise a wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines. The communication medium may form part of a packet-based network, such as a local area network, a wide-area network, or a global network such as the Internet. The communication medium may include routers, switches, base stations, or other equipment that facilitates communication from source device 1212 to destination device 1214. In another example, channel 1216 may correspond to a storage medium that stores the encoded video data generated by source device 1212.

In the example of FIG. 12 , source device 1212 includes a video source 1218, video encoder 1220, and an output interface 1222. In some cases, output interface 1228 may include a modulator/demodulator (modem) and/or a transmitter. In source device 1212, video source 1218 may include a source such as a video capture device, e.g., a video camera, a video archive containing previously captured video data, a video feed interface to receive video data from a video content provider, and/or a computer graphics system for generating video data, or a combination of such sources.

Video encoder 1220 may encode the captured, pre-captured, or computer-generated video data. An input image may be received by the video encoder 1220 and stored in the input frame memory 1221. The general purpose processor 1223 may load information from here and perform encoding. The program for driving the general purpose processor may be loaded from a storage device, such as the example memory modules depicted in FIG. 12 . The general purpose processor may use processing memory 1222 to perform the encoding, and the output of the encoding information by the general processor may be stored in a buffer, such as output buffer 1226.

The video encoder 1220 may include a resampling module 1225 which may be configured to code (e.g., encode) video data in a scalable video coding scheme that defines at least one base layer and at least one enhancement layer. Resampling module 1225 may resample at least some video data as part of an encoding process, wherein resampling may be performed in an adaptive manner using resampling filters.

The encoded video data, e.g., a coded bit stream, may be transmitted directly to destination device 1214 via output interface 1228 of source device 1212. In the example of FIG. 12 , destination device 1214 includes an input interface 1238, a video decoder 1230, and a display device 1232. In some cases, input interface 1228 may include a receiver and/or a modem. Input interface 1238 of destination device 1214 receives encoded video data over channel 1216. The encoded video data may include a variety of syntax elements generated by video encoder 1220 that represent the video data. Such syntax elements may be included with the encoded video data transmitted on a communication medium, stored on a storage medium, or stored a file server.

The encoded video data may also be stored onto a storage medium or a file server for later access by destination device 1214 for decoding and/or playback. For example, the coded bitstream may be temporarily stored in the input buffer 1231, then loaded in to the general purpose processor 1233. The program for driving the general purpose processor may be loaded from a storage device or memory. The general purpose processor may use a process memory 1232 to perform the decoding. The video decoder 1230 may also include a resampling module 1235 similar to the resampling module 1225 employed in the video encoder 1220.

FIG. 12 depicts the resampling module 1235 separately from the general purpose processor 1233, but it would be appreciated by one of skill in the art that the resampling function may be performed by a program executed by the general purpose processor, and the processing in the video encoder may be accomplished using one or more processors. The decoded image(s) may be stored in the output frame buffer 1236 and then sent out to the input interface 1238.

Display device 1238 may be integrated with or may be external to destination device 1214. In some examples, destination device 1214 may include an integrated display device and may also be configured to interface with an external display device. In other examples, destination device 1214 may be a display device. In general, display device 1238 displays the decoded video data to a user.

Video encoder 1220 and video decoder 1230 may operate according to a video compression standard. ITU-T VCEG (Q6/16) and ISO/IEC MPEG (JTC 1/SC 29/WG 11) are studying the potential need for standardization of future video coding technology with a compression capability that significantly exceeds that of the current High Efficiency Video Coding HEVC standard (including its current extensions and near-term extensions for screen content coding and high-dynamic-range coding). The groups are working together on this exploration activity in a joint collaboration effort known as the Joint Video Exploration Team (NET) to evaluate compression technology designs proposed by their experts in this area. A recent capture of JVET development is described in the “Algorithm Description of Joint Exploration Test Model 5 (JEM 5)”, JVET-E1001-V2, authored by J. Chen, E. Alshina, G. Sullivan, J. Ohm, J. Boyce.

Additionally or alternatively, video encoder 1220 and video decoder 1230 may operate according to other proprietary or industry standards that function with the disclosed JVET features. Thus, other standards such as the ITU-T H.264 standard, alternatively referred to as MPEG-4, Part 10, Advanced Video Coding (AVC), or extensions of such standards. Thus, while newly developed for NET, techniques of this disclosure are not limited to any particular coding standard or technique. Other examples of video compression standards and techniques include MPEG-2, ITU-T H.263 and proprietary or open source compression formats and related formats.

Video encoder 1220 and video decoder 1230 may be implemented m hardware, software, firmware or any combination thereof. For example, the video encoder 1220 and decoder 1230 may employ one or more processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, or any combinations thereof. When the video encoder 1220 and decoder 1230 are implemented partially in software, a device may store instructions for the software in a suitable, non-transitory computer-readable storage medium and may execute the instructions in hardware using one or more processors to perform the techniques of this disclosure. Each of video encoder 1220 and video decoder 1230 may be included in one or more encoders or decoders, either of which may be integrated as part of a combined encoder/decoder (CODEC) in a respective device.

Aspects of the subject matter described herein may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer, such as the general-purpose processors 1223 and 1233 described above. Generally, program modules include routines, programs, objects, components, data structures, and so forth, which perform particular tasks or implement particular abstract data types. Aspects of the subject matter described herein may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

Examples of memory include random access memory (RAM), read only memory (ROM), or both. Memory may store instructions, such as source code or binary code, for performing the techniques described above. Memory may also be used for storing variables or other intermediate information during execution of instructions to be executed by a processor, such as processor 1223 and 1233.

A storage device may also store instructions, instructions, such as source code or binary code, for performing the techniques described above. A storage device may additionally store data used and manipulated by the computer processor. For example, a storage device in a video encoder 1220 or a video decoder 1230 may be a database that is accessed by computer system 1223 or 1233. Other examples of storage device include random access memory (RAM), read only memory (ROM), a hard drive, a magnetic disk, an optical disk, a CD-ROM, a DVD, a flash memory, a USB memory card, or any other medium from which a computer can read.

A memory or storage device may be an example of a non-transitory computer-readable storage medium for use by or in connection with the video encoder and/or decoder. The non-transitory computer-readable storage medium contains instructions for controlling a computer system to be configured to perform functions described by particular embodiments. The instructions, when executed by one or more computer processors, may be configured to perform that which is described in particular embodiments.

Also, it is noted that some embodiments have been described as a process which can be depicted as a flow diagram or block diagram. Although each may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be rearranged. A process may have additional steps not included in the figures.

Particular embodiments may be implemented in a non-transitory computer-readable storage medium for use by or in connection with the instruction execution system, apparatus, system, or machine. The computer-readable storage medium contains instructions for controlling a computer system to perform a method described by particular embodiments. The computer system may include one or more computing devices. The instructions, when executed by one or more computer processors, may be configured to perform that which is described in particular embodiments

As used in the description herein and throughout the claims that follow, “a”, “an”, and “the” includes plural references unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.

Although exemplary embodiments of the invention have been described in detail and in language specific to structural features and/or methodological acts above, it is to be understood that those skilled in the ait will readily appreciate that many additional modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of the invention. Moreover, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Accordingly, these and all such modifications are intended to be included within the scope of this invention construed in breadth and scope in accordance with the appended claims. 

What is claimed is:
 1. A method of decoding a video included in a bitstream by a decoder, comprising: (a) receiving said bitstream, where said bitstream includes at least one slice, indicating how a coding tree unit was partitioned into coding units according to a quad tree plus multi tree structure that allows a square parent node to be split with a quaternary tree partitioning that splits said square parent node in half in both horizontal and vertical directions to define leaf nodes that are square in shape each of which are the same size, wherein said quad tree plus multi tree structure allows one of said leaf nodes to be split based upon one selected from a group consisting of, (i) a symmetric binary tree partitioning that splits one of said leaf nodes of said quaternary tree partitioning in half in either a horizontal direction or a vertical direction resulting in two blocks that are the same size as leaf nodes, and (ii) an asymmetric tree partitioning that splits one of said leaf nodes of said quaternary tree partitioning in either a horizontal direction or a vertical direction resulting in three blocks two of which are different in size than a third one of said three blocks as leaf nodes; (b) identifying final coding units to be decoded represented by leaf nodes of the quad tree plus multi tree structure; (c) receiving both (1) a first motion vector associated with a coding unit of a B-slice of a current frame of said video, where one of said final coding units is said coding unit included in a bi-predictive slice of said current frame of said video, referencing a temporally previous reference slice of a temporally previous reference frame relative to said current frame of said coding unit, and a (2) a second motion vector associated with said coding unit of said B-slice of said current frame of said video referencing a temporally future reference slice of a temporally future frame relative to said current frame of said coding unit; (d) wherein said coding unit of said B-slice of said current frame of said video has a top neighboring row, a left neighboring column, a bottom neighboring row and a right neighboring column, each of said top neighboring row, left neighboring column, bottom neighboring row, and right neighboring column in the said current frame; (e) modifying at least one of said first motion vector and said second motion vector based at least in part upon the other of said at least one of said first motion vector and said second motion vector and based upon an optical flow of said temporally previous reference slice and said temporally future reference slice; (f) decoding said coding unit based upon said modified at least one of said first motion together with said temporally previous reference slice of said temporally previous frame and said second motion vector together with said temporally future reference slice of said temporally future frame.
 2. A method of encoding a video included in a bitstream by an encoder, comprising: (a) providing said bitstream, where said bitstream includes at least one slice, indicating how a coding tree unit was partitioned into coding units according to a quad tree plus multi tree structure that allows a square parent node to be split with a quaternary tree partitioning that splits said square parent node in half in both horizontal and vertical directions to define leaf nodes that are square in shape each of which are the same size, wherein said quad tree plus multi tree structure allows one of said leaf nodes to be split based upon one selected from a group consisting of, (i) a symmetric binary tree partitioning that splits one of said leaf nodes of said quaternary tree partitioning in half in either a horizontal direction or a vertical direction resulting in two blocks that are the same size as leaf nodes, and (ii) an asymmetric tree partitioning that splits one of said leaf nodes of said quaternary tree partitioning in either a horizontal direction or a vertical direction resulting in three blocks two of which are different in size than a third one of said three blocks as leaf nodes; (b) wherein said bitstream is configured for identifying final coding units to be decoded represented by leaf nodes of the quad tree plus multi tree structure; (c) providing both (1) a first motion vector associated with a coding unit of a B-slice of a current frame of said video, where one of said final coding units is said coding unit included in a bi-predictive slice of said current frame of said video, referencing a temporally previous reference slice of a temporally previous reference frame relative to said current frame of said coding unit, and a (2) a second motion vector associated with said coding unit of said B-slice of said current frame of said video referencing a temporally future reference slice of a temporally future frame relative to said current frame of said coding unit; (d) wherein said coding unit of said B-slice of said current frame of said video has a top neighboring row, a left neighboring column, a bottom neighboring row and a right neighboring column, each of said top neighboring row, left neighboring column, bottom neighboring row, and right neighboring column in the said current frame; (e) wherein said bitstream is configured for modifying at least one of said first motion vector and said second motion vector based at least in part upon the other of said at least one of said first motion vector and said second motion vector and based upon an optical flow of said temporally previous reference slice and said temporally future reference slice; (f) encoding said coding unit based upon said modified at least one of said first motion together with said temporally previous reference slice of said temporally previous frame and said second motion vector together with said temporally future reference slice of said temporally future frame.
 3. A bitstream of compressed video data for decoding by a decoder, including a computer readable storage medium storing the compressed video data, the bitstream comprising: (a) said bitstream, where said bitstream includes at least one slice, containing data indicating how a coding tree unit was partitioned into coding units according to a quad tree plus multi tree structure that allows a square parent node to be split with a quaternary tree partitioning that splits said square parent node in half in both horizontal and vertical directions to define leaf nodes that are square in shape each of which are the same size, wherein said quad tree plus multi tree structure allows one of said leaf nodes to be split based upon one selected from a group consisting of, (i) a symmetric binary tree partitioning that splits one of said leaf nodes of said quaternary tree partitioning in half in either a horizontal direction or a vertical direction resulting in two blocks that are the same size as leaf nodes, and (ii) an asymmetric tree partitioning that splits one of said leaf nodes of said quaternary tree partitioning in either a horizontal direction or a vertical direction resulting in three blocks two of which are different in size than a third one of said three blocks as leaf nodes; (b) wherein said bitstream is configured for identifying final coding units to be decoded represented by leaf nodes of the quad tree plus multi tree structure; (c) wherein said bitstream is configured for receiving both (1) a first motion vector associated with a coding unit of a B-slice of a current frame of said video, where one of said final coding units is said coding unit included in a bi-predictive slice of said current frame of said video, referencing a temporally previous reference slice of a temporally previous reference frame relative to said current frame of said coding unit, and a (2) a second motion vector associated with said coding unit of said B-slice of said current frame of said video referencing a temporally future reference slice of a temporally future frame relative to said current frame of said coding unit; (d) wherein said coding unit of said B-slice of said current frame of said video has a top neighboring row, a left neighboring column, a bottom neighboring row and a right neighboring column, each of said top neighboring row, left neighboring column, bottom neighboring row, and right neighboring column in the said current frame; (e) wherein said bitstream is configured for modifying at least one of said first motion vector and said second motion vector based at least in part upon the other of said at least one of said first motion vector and said second motion vector and based upon an optical flow of said temporally previous reference slice and said temporally future reference slice; (f) wherein said bitstream is configured for decoding said coding unit based upon said modified at least one of said first motion together with said temporally previous reference slice of said temporally previous frame and said second motion vector together with said temporally future reference slice of said temporally future frame. 